Algorithms for linear groups of finite rank

نویسنده

  • A. S. Detinko
چکیده

Article history: Received 21 January 2013 Available online 16 July 2013 Communicated by Derek Holt

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Triple factorization of non-abelian groups by two maximal subgroups

The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...

متن کامل

Definably Linear Groups of Finite Morley Rank

Introduction. Zilber’s original trichotomy conjecture proposed an explicit classification of all one-dimensional objects arising in model theory. At one point, classifying the simple groups of finite Morley rank was viewed as a subproblem whose affirmative answer would justify this conjecture. Zilber’s conjecture was eventually refuted by Hrushovski [9], and the classification of simple groups ...

متن کامل

Linear representations of soluble groups of finite Morley rank

Sufficient conditions are given for groups of finite Morley rank having non-trivial torsion-free nilpotent normal subgroups to have linear representations with small kernels. In particular, centreless connected soluble groups of finite Morley rank with torsion-free Fitting subgroups have faithful linear representations. On the way, using a notion of definable weight space, we prove that certain...

متن کامل

A Probabilistic Approach toward the Finite General Linear and Unitary Groups

Abstract Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg’s count of unipotent elements, Rudvalis and Shindoda’s work on the fixed space of a random matrix, and Lusztig’s work on counting nilpotent matrices of ...

متن کامل

Finite $p$-groups and centralizers of non-cyclic abelian subgroups

A $p$-group $G$ is called a $mathcal{CAC}$-$p$-group if $C_G(H)/H$ is ‎cyclic for every non-cyclic abelian subgroup $H$ in $G$ with $Hnleq‎ ‎Z(G)$‎. ‎In this paper‎, ‎we give a complete classification of‎ ‎finite $mathcal{CAC}$-$p$-groups‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013